Bisectors of linearly separable sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linearly Separable Boolean Function

The maximum absolute value of integral weights sufficient to represent any linearly separable Boolean function is investigated. It is shown that upper bounds exhibited by Muroga (1971) for rational weights satisfying the normalized System of inequalities also hold for integral weights. Therewith, the previous best known upper bound for integers is improved by approximately a factor of 1/2.

متن کامل

Learning Linearly Separable Languages

For a finite alphabet A, we define a class of embeddings of A∗ into an infinite-dimensional feature space X and show that its finitely supported hyperplanes define regular languages. This suggests a general strategy for learning regular languages from positive and negative examples. We apply this strategy to the piecewise testable languages, presenting an embedding under which these are precise...

متن کامل

On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs

We answer a question raised by Walter Morris, and independently by Alon Efrat, about the maximum cardinality of an anti-chain composed of intersections of a given set of n points in the plane with half-planes. We approach this problem by establishing the equivalence with the problem of the maximum monotone path in an arrangement of n lines. A related problem on convex pseudo-discs is also discu...

متن کامل

Selection of the Linearly Separable Feature Subsets

We address a situation when more than one feature subset allows for linear separability of given data sets. Such situation can occur if a small number of cases is represented in a highly dimensional feature space. The method of the feature selection based on minimisation of a special criterion function is here analysed. This criterion function is convex and piecewise-linear (CPL). The proposed ...

متن کامل

MinSVM for Linearly Separable and Imbalanced Datasets

Class imbalance (CI) is common in most non synthetic datasets, which presents a major challenge for many classification algorithms geared towards optimized overall accuracy whenever the minority class risk loss is often higher than the majority class one. Support vector machine (SVM), a machine learning (ML) technique deeply rooted in statistics, maximizes linear margins between classes and gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 1991

ISSN: 0179-5376,1432-0444

DOI: 10.1007/bf02574688